An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
نویسندگان
چکیده
منابع مشابه
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the varia...
متن کاملA Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean varia...
متن کاملAn Effective Cost Lower Bound for Multistage Stochastic Linear Programming
Multistage Stochastic Linear Programming (SLP) suffers from scenario explosion as the number of stages or the number of stochastic parameters increases. In this case, either one solves the SLP model approximately or one solves an approximation to the SLP model. In this situation it is useful to have some cost bound in order to assess the quality of approximated solutions. In this paper we intro...
متن کاملAn Effective Algorithm for Globally Solving a Class of Linear Fractional Programming Problem
This article presents a branch-and-bound algorithm for globally solving the general linear sum of ratios problem (GFP). By utilizing equivalent transformation and linearization technique, a linear relaxation programming (LRP) of original problem is constructed. The algorithm economizes the required computations by conducting the branch-and-bound search in p R , rather than in n R , where p is t...
متن کاملA Branch and Bound Algorithm for Separable Concave Programming
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/160262